An Ergodic Algorithm for Generating Knots with a Prescribed Injectivity Radius
نویسندگان
چکیده
The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections. To prove the existence of the algorithm, we describe a method for turning any knot into the regular planar polygon using only thickness non-decreasing moves. This approach ensures that the algorithm has a positive probability of connecting any two knots with the required thickness constraint and so is ergodic. This ergodic sampling unlocks the ability to analyze the effects of thickness on properties of the geometric knot such as radius of gyration. This algorithm will be shown to be faster than previous methods for generating thick knots, and the data from this algorithm shows that the radius of gyration increases strongly with thickness and that the growth exponent for radius of gyration increases with thickness.
منابع مشابه
Local Structure of Ideal Shapes of Knots
Relatively extremal knots are the relative minima of the ropelength functional in the C1 topology. They are the relative maxima of the thickness (normal injectivity radius) functional on the set of curves of xed length, and they include the ideal knots. We prove that a C1;1 relatively extremal knot in Rn either has constant maximal (generalized) curvature, or its thickness is equal to half of ...
متن کاملAn Inequality for the Matrix Pressure Function and Applications
We prove an a priori lower bound for the pressure, or p-norm joint spectral radius, of a measure on the set of d × d real matrices which parallels a result of J. Bochi for the joint spectral radius. We apply this lower bound to give new proofs of the continuity of the affinity dimension of a selfaffine set and of the continuity of the singular-value pressure for invertible matrices, both of whi...
متن کاملGauss Quadratures and Jacobi Matrices for Weight Functions Not of One Sign
Construction of Gauss quadratures with prescribed knots via Jacobi matrices is extended to the case where not all orthogonal polynomials exist due to the weight function changing sign. An algorithm is described and is demonstrated by calculating the knots of Kronrod schemes and other Gauss quadratures with prescribed knots.
متن کاملar X iv : 0 70 6 . 10 37 v 1 [ m at h . G T ] 7 J un 2 00 7 Local Structure of Ideal Shapes of Knots , II Constant Curvature Case
The thickness, NIR(K) of a knot or link K is defined to be the radius of the largest solid tube one can put around the curve without any self intersections, which is also known as the normal injectivity radius of K. For C1,1 curves K, NIR(K) = min{ 1 2 DCSC(K), 1 supκ(K) )}, where κ(K) is the generalized curvature, and the double critical self distance DCSD(K) is the shortest length of the segm...
متن کاملLocal Structure of Ideal Shapes of Knots, II Constant Curvature Case
The thickness, NIR(K) of a knot or link K is defined to be the radius of the largest open solid tube one can put around the curve without any self intersections of the normal discs, which is also known as the normal injectivity radius ofK. For C1,1 curvesK, NIR(K) = min{ 1 2 DCSC(K), 1 supκ(K) )}, where κ(K) is the generalized curvature, and the double critical self distance DCSD(K) is the shor...
متن کامل